#include"BinarySearchTree.h"



int main()
{
	int arr[] = { 8,3,1,10,16,4,7,14,13 };
	BSTree<int> t1;

	for (auto e : arr)
	{
		t1.Insert(e);
	}

	t1.InOrder();

	t1.Erase(8);
	t1.InOrder();

	/*t1.Erase(3);
	t1.InOrder();*/
	return 0;
}